Huffman tree based metric derivation for a low-complexity sequential soft VLC decoding
نویسندگان
چکیده
This paper considers VLC decoding algorithms based on MAP sequence estimation techniques, using residual source redundancy to provide channel error correction. These algorithms rely on soft values available at the entrance of the VLC decoder. We present here a new soft VLC decoding algorithm based on a sequential decoding technique that is very efficient in terms of decoding complexity. The application of the considered soft decoding algorithms to practical decoding of MPEG-4 texture information packets under the assumption of an unequal protection scheme is investigated. Algorithm performance is evaluated on the well-known “Foreman” video sequence. Simulation results show that the proposed algorithm provides approximately the same performance as all existing soft decoding algorithms while exhibiting a significantly lower complexity.
منابع مشابه
A Novel Decoding Algorithm for Reversible Variable Length Codes Based on the Massey Metric
The use of Variable Length Codes (VLC) to increase the coding efficiency based on the statistical characteristics of the data has long been employed in digital communication systems. However the catastrophic degradation of VLC encoded data which results from bit errors has led to the development of reversible variable length codes (RVLC) that can be decoded bidirectionally thereby having more e...
متن کاملSequential Decoding for Mobile Receivers
Currently many classical detection and decoding algorithms receive new attention in mobile communications. Amongst those classics are low density parity check codes [1], concatenated codes [2], weighted decoding with log-likelihood values as well as soft-in/soft-out decoding as performed by the BCJR algorithm and its derivatives [4], [5]. All four classics show up as key elements in the so-call...
متن کاملA Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric
A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the cost of the unexplored portion of the code tree. It is shown that for certain block codes the average computational complexity of this metric is superior to that of the Fano metric. A new function, the cumulative column di...
متن کاملReduced complexity maximum a posteriori decoding of variable-length codes
Until very recently, joint source channel techniques mostly focused on systems using fixed-length coding, eventhough variable-length coding (VLC) is widely used, particularly in video coding. Typically, VLC bit streams are made channel-robust through packetization and standard forward-error correction (FEC). However, when the channel conditions are fairly mild, FEC can reveal itself bandwidth-i...
متن کاملAdaptive Error Restricted Map Decoding of Vlc
Joint source channel techniques based on variable-length coding (VLC) have been widely used, particularly in video coding. One of the most famous methods of decoding VLC is optimal maximum a posteriori (MAP) decoder based on directed graph search and soft-input theories. Because the computation complexity of this method is square to the bit numbers of a packet, many techniques have been propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002